The Electric Vehicle Routing Problem with Capacitated Charging Stations

Electric vehicle routing problems (E-VRPs) deal with a fleet of electric vehicles (EVs) to serve set customers while minimizing an operational criterion, for example, cost or time. The feasibility the routes is constrained by autonomy EVs, which may be recharged along route. Much E-VRP research neglects capacity charging stations (CSs) and thus implicitly assumes that unlimited number EVs can simultaneously charged at CS. In this paper, we model solve E-VRPs considering these restrictions. particular, study nonlinear functions, multiple technologies, en route charging, variable quantities explicitly accounting chargers available privately managed CSs. We refer problem as functions capacitated (E-VRP-NL-C). introduce continuous-time formulation problem. then algorithmic framework iterates between two main components: (1) generator, uses iterated local search algorithm build pool high-quality routes, (2) solution assembler, applies branch-and-cut combine subset from into satisfying constraints. compare four assembly strategies on instances. show our effectively deals E-VRP-NL-C. Furthermore, uncapacitated version E-VRP-NL-C, method identifies new best-known solutions 80 120